Error bounds for linear recurrence relations
نویسندگان
چکیده
منابع مشابه
Linear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and edges, deletion of edges, and relabelings. Let Gn be a iteratively constructible sequence of graphs. In a recent paper, [27], M. Noy and A. Ribò have proven linear recurrences with polynomial coe...
متن کاملError Bounds for Linear Matrix Inequalities
For iterative sequences that converge to the solution set of a linear matrix inequality, we show that the distance of the iterates to the solution set is at most O(2 ?d). The nonnegative integer d is the so{called degree of singularity of the linear matrix inequality, and denotes the amount of constraint violation in the iterate. For infeasible linear matrix inequalities, we show that the minim...
متن کاملGeneralisation Error Bounds for Sparse Linear Classifiers
We provide small sample size bounds on the generalisation error of linear classiiers that are sparse in their dual representation given by the expansion coeecients of the weight vector in terms of the training data. These results theoretically justify algorithms like the Support Vector Machine, the Relevance Vector Machine and K-nearest-neighbour. The bounds are a-posteriori bounds to be evalua...
متن کاملRegularities and their relations to error bounds
In this paper, we mainly study various notions of regularity for a finite collection {C1, · · · , Cm} of closed convex subsets of a Banach space X and their relations with other fundamental concepts. We show that a proper lower semicontinuous function f on X has a Lipschitz error bound (resp., Υ-error bound) if and only if the pair {epi(f), X×{0}} of sets in the product space X × R is linearly ...
متن کاملAutomated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds
Abstract. We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. Several classical textbook algorithms have quite efficient expected-runtime complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., QUICK-SORT), or completely ineffective (e.g., COUPON-COLLECTOR). Since the main foc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1988
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1988-0929547-9